Multirobot Reconnection on Graphs: Problem, Complexity, and Algorithms
نویسندگان
چکیده
منابع مشابه
the effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولTree spanners on chordal graphs: complexity and algorithms
A tree t-spanner T in a graph G is a spanning tree of G such that the distance in T between every pair of vertices is at most t times their distance in G. The TREE t-SPANNER problem asks whether a graph admits a tree t-spanner, given t. We substantially strengthen the hardness result of Cai and Corneil (SIAM J. Discrete Math. 8 (1995) 359–387) by showing that, for any t¿ 4, TREE t-SPANNER is NP...
متن کاملThe Weighted Sparsity Problem: Complexity and Algorithms
Many optimization algorithms involve repeated processing of a fixed set of linear constraints. If we pre-process the constraint matrix A to make it sparser, algebraic operations should become faster. In many applications there is a priori information about the likelihood that each column will appear in a basis, which can be expressed as weights on the columns. This leads to considering the Weig...
متن کاملThe Shortcut Problem - Complexity and Algorithms
We study a graph-augmentation problem arising from a technique applied in recent approaches for route planning. Many such methods enhance the graph by inserting shortcuts, i.e., additional edges (u,v) such that the length of (u,v) is the distance from u to v. Given a weighted, directed graph G and a number c ∈ Z>0, the shortcut problem asks how to insert c shortcuts into G such that the expecte...
متن کاملGraphs and Algorithms Problem 1 First Direction
2. Alice selects some edge e′ = {v′, w} adjacent to v′. Whichever edge this is, it can not be part of M because v′ is already matched be e and e′ 6= e because v has already been visited. Again, it is Bob’s turn and we are at some vertex w. Since the edge taken by Alice could not have been part of M (as argued above), Bob can again follow the strategy and pick the unique edge in M containing w. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Robotics
سال: 2018
ISSN: 1552-3098,1941-0468
DOI: 10.1109/tro.2018.2830418